T Offline and Online Evolutionary Bi - Directional RRT Algorithms for Efficient Re - Planning in Environments with Moving Obstacles
نویسندگان
چکیده
منابع مشابه
Single-Agent On-line Path Planning in Continuous, Unpredictable and Highly Dynamic Environments
This document is a thesis on the subject of single-agent on-line path planning in continuous,unpredictable and highly dynamic environments. The problem is finding and traversing a collision-free path for a holonomic robot, without kinodynamic restrictions, moving in an environment with several unpredictably moving obstacles or adversaries. The availability of perfect information of the environm...
متن کاملImproving lifting motion planning and re-planning of cranes with consideration for safety and efficiency
Please cite this article in press as: C. Zhang, A. efficiency, Adv. Eng. Informat. (2012), doi:10.10 Safe and efficient operation of cranes requires not only good planning, but also sufficient and appropriate support in real time. Due to the dynamic nature of construction sites, unexpected changes in site layout may create new obstacles for the crane that can result in collisions and accidents....
متن کاملStudy of Evolutionary and Swarm Intelligent Techniques for Soccer Robot Path Planning
Finding an optimal path for a robot in a soccer field involves different parameters such as the positions of the robot, positions of the obstacles, etc. Due to simplicity and smoothness of Ferguson Spline, it has been employed for path planning between arbitrary points on the field in many research teams. In order to optimize the parameters of Ferguson Spline some evolutionary or intelligent al...
متن کاملOn-line Path Planning for Mobile Robots in Dynamic Environments
Motion planning of mobile robots is a complex problem. The complexity further increases when it comes to path planning in dynamic environments. This paper presents an algorithm for on-line path planning of mobile robots in unknown environments with moving obstacles. A mathematical model is established which considers all the current on-line information of robot as well as nearing obstacles. Par...
متن کاملImproving RRT with Context Sensitivity 15-780 Grad AI
The RRT algorithm represents an extreme in the design space of planning algorithms. It forsakes optimality and explores the space through randomness and a small bias towards goals. This is in marked contrast to other planning strategies such as visibility graphs or voronoi diagrams which carefully analyze and partition the space to find paths. This difference makes RRT very efficient even in hi...
متن کامل